Solving secular and polynomial equations: A multiprecision algorithm

A Consistently Rapid Algorithm for Solving Polynomial Equations ~

Novel approaches are used to ensure consistently rapid convergence of an algorithm, based on Newton’s method, for the solution of polynomial equations with real or complex coefficients.lt appears that in terms of algorithm complexity and calculation time, the new algorithm represents a considerable improvement on the various always convergent algorithms in the literature. In terms of algorithm ...

Solving Polynomial Equations

Solving Monotone Polynomial Equations

We survey some recent results on iterative methods for approximating the least solution of a system of monotone fixed-point polynomial equations.

A numerical algorithm for solving a class of matrix equations

In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$  by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.

Solving Systems of Polynomial Equations